Representing Component States in Higher-Order Logic
نویسندگان
چکیده
Component states can be formalized in higher-order logic as (1) functions from variables to values and (2) records, among other possibilities. Variable-to-value maps are natural, but they yield weak typing and restrict the user to a predefined value space. Record types define component signatures and properties need to be transferred between the various signatures. The method yields strong typing, but transferring properties requires an elaborate theory and not all properties can be transferred. The paper reports experiments with a third method: the state is represented by an abstract type. The method is described and contrasted with respect to the others.
منابع مشابه
Modal Higher-order Logic for Agents
This paper introduces a modal higher-order logic for representing belief states of agents. The syntax and semantics of the logic and a tableau system for proving theorems are presented and an indication given as to how the logic can be used for building multi-agent systems. The main ideas are illustrated by an extended example concerning a user agent for the Internet.
متن کاملA Higher Order Modal Fixed Point Logic
We present a higher order modal fixed point logic (HFL) that extends the modal μ-calculus to allow predicates on states (sets of states) to be specified using recursively defined higher order functions on predicates. The logic HFL includes negation as a first-class construct and uses a simple type system to identify the monotonic functions on which the application of fixed point operators is se...
متن کاملEfficiency Improvement of Induction Motor using Fuzzy-Genetic Algorithm
In most industrial zones, electric energy is one of the most important energy sources. Since electrical motors are the main energy consumers of industrial factories, consumption optimization in these motors can be considered as a main option related to energy saving. One very effective way to reduce the consumption of these equipment is to use a motor speed controllers or drives. Since the loss...
متن کاملHigher-Order Computational Logic
This paper presents the case for the use of higher-order logic as a foundation for computational logic. A suitable polymorphicallytyped, higher-order logic is introduced and its syntax and proof theory briefly described. In addition, a metric space of closed terms suitable for knowledge representation purposes is presented. The approach to representing individuals is illustrated with some examp...
متن کاملSledgehammer: Judgement Day
Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS and Vampire. This paper is the largest and most detailed empirical evaluation of such a link to date. Our test data consists of 1240 proof goals arising in 7 diverse Isabelle theories, thus representing typical Isabelle proof ob...
متن کامل